Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform - Part one: Without context models

Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform .2. With context models

Architecture for Efficient Implementation of the YK Lossless Data Compression Algorithm

The YK (Yang-Kieffer) algorithm [1,2] is a sequential lossless data compression built upon an efficient greedy grammar transform. This grammar transform constructs a sequence of irreducible context-free grammars from which the original data sequence can be recovered incrementally. The transform sequentially parses the original data into nonoverlapping variable-length phrases, and updates the gr...

Study On Universal Lossless Data Compression by using Context Dependence Multilevel Pattern Matching Grammar Transform

In this paper, the context dependence multilevel pattern matching(in short CDMPM) grammar transform is proposed; based on this grammar transform, the universal lossless data compression algorithm, CDMPM code is then developed. Moreover, it is proved that this algorithms’ worst case redundancy among all individual sequences of length n from a finite alphabet is upper bounded by ) log / 1 ( n C w...

Applications of YK Algorithm to the Internet Transmission of Web-Data: Implementation Issues and Modifications

Recently, Yang and Kieffer’ proposed a novel lossless grammar-based data compression algorithm, called the YK algorithm, in which a greedy sequential grammar transform is applied to the original data to construct an irreducible context free grammar, which is encoded indirectly by using an arithmetic coder. The YK algorithm has been shown to be universal for the class of stationary, ergodic sour...

Universal lossless data compression with side information by using a conditional MPM grammar transform

A grammar transform is a transformation that converts any data sequence to be compressed into a grammar from which the original data sequence can be fully reconstructed. In a grammar-based code, a data sequence is first converted into a grammar by a grammar transform and then losslessly encoded. Among several recently proposed grammar transforms is the multilevel pattern matching (MPM) grammar ...